Contemporary Methods for Graph Coloring as an Example of Discrete Optimization

This paper provides an insight into graph coloring application of the contemporary heuristic methods. It discusses a variety algorithmic solutions for The Graph Coloring Problem (GCP) and makes recommendations implementation. GCP is NP-hard problem, which aims at finding minimum number colors vertices in such way, that none two adjacent are marked with same color.With advent multicore processing technology, metaheuristic approach to solving reemerged as means discrete optimization. To explain phenomenon these methods, author thorough survey AI-based algorithms GCP, while pointing out main differences between all techniques.